Maximum flow problem

Results: 146



#Item
21Lecture notes for “Analysis of Algorithms”: Global minimum cuts (Draft) Lecturer: Uri Zwick ∗

Lecture notes for “Analysis of Algorithms”: Global minimum cuts (Draft) Lecturer: Uri Zwick ∗

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2011-01-18 10:58:41
22Interior-­‐point  Methods  and     the  Maximum  Flow  Problem   Aleksander  Mądry   What  will  this  talk  be  about?  

Interior-­‐point  Methods  and     the  Maximum  Flow  Problem   Aleksander  Mądry   What  will  this  talk  be  about?  

Add to Reading List

Source URL: lear.inrialpes.fr

Language: English - Date: 2015-02-02 03:52:42
    23Assertion-Based Flow Monitoring of SystemC Models Sonali Dutta Moshe Y. Vardi

    Assertion-Based Flow Monitoring of SystemC Models Sonali Dutta Moshe Y. Vardi

    Add to Reading List

    Source URL: www.cs.rice.edu

    Language: English - Date: 2014-08-26 15:23:08
    24CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The

    CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The

    Add to Reading List

    Source URL: stanford.edu

    Language: English - Date: 2015-03-23 01:44:18
    25PHASE IMAGING: UNWRAPPING AND DENOISING WITH DIVERSITY AND MULTI-RESOLUTION Gonc¸alo Valad˜ao and Jos´e Bioucas-Dias Instituto de Telecomunicac¸o˜ es and Instituto Superior T´ecnico, Av. Rovisco Pais, Torre Norte,

    PHASE IMAGING: UNWRAPPING AND DENOISING WITH DIVERSITY AND MULTI-RESOLUTION Gonc¸alo Valad˜ao and Jos´e Bioucas-Dias Instituto de Telecomunicac¸o˜ es and Instituto Superior T´ecnico, Av. Rovisco Pais, Torre Norte,

    Add to Reading List

    Source URL: ticsp.cs.tut.fi

    Language: English - Date: 2008-09-03 05:20:54
    26CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

    CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

    Add to Reading List

    Source URL: stanford.edu

    Language: English - Date: 2015-03-23 01:43:36
    27Improved Approximation for the Directed Spanner Problem∗ Piotr Bermana , Arnab Bhattacharyyab,1 , Konstantin Makarychevc , Sofya Raskhodnikovaa,2 , Grigory Yaroslavtseva,2 a

    Improved Approximation for the Directed Spanner Problem∗ Piotr Bermana , Arnab Bhattacharyyab,1 , Konstantin Makarychevc , Sofya Raskhodnikovaa,2 , Grigory Yaroslavtseva,2 a

    Add to Reading List

    Source URL: konstantin.makarychev.net

    Language: English - Date: 2014-06-08 22:16:08
    28New complexity results for time-constrained dynamical optimal path problems

    New complexity results for time-constrained dynamical optimal path problems

    Add to Reading List

    Source URL: www.emis.ams.org

    Language: English - Date: 2010-02-01 11:59:55
    29Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

    Better bounds for matchings in the streaming model Michael Kapralov∗ arXiv:1206.2269v2 [cs.DS] 26 JulDecember 6, 2013

    Add to Reading List

    Source URL: arxiv.org

    Language: English - Date: 2013-12-06 12:53:09
    30Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4

    Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4

    Add to Reading List

    Source URL: www.liafa.jussieu.fr

    Language: English - Date: 2012-04-26 12:04:26